Tilings of rectangles with T-tetrominoes
نویسندگان
چکیده
We prove that any two tilings of a rectangular region by T-tetrominoes are connected by moves involving only 2 and 4 tiles. We also show that the number of such tilings is an evaluation of the Tutte polynomial. The results are extended to a more general class of regions.
منابع مشابه
On the number of tilings of the rectangular board with T-tetronimoes
The classical combinatorial problem of counting domino tilings of a 2n × 2m rectangle was solved by P.W. Kasteleyn and also by H.N.V. Temperley and M.E. Fisher in 1961. We shall consider the similar problem for T-tetrominoes, that is, pieces formed by 4 unit squares in the shape of a T. We give explicit formulae for the number of tilings with T-tetrominoes for the 4n × 4m rectangle when n = 1, ...
متن کاملFaultfree Tromino Tilings of Rectangles
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of crossing numbers for tilings and derive bounds on the crossing numbers of faultfree tilings. We develop an iterative scheme for generating faultfree tromino tilings for rectangles and derive the closed form expression for the exact number of faultfree...
متن کاملTetromino tilings and the Tutte polynomial
We consider tiling rectangles of size 4m × 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is shown to be the evaluation of the multivariate Tutte polynomial ZG(Q,v) (known also to physicists as the partition function of the Q-state Potts model) on a...
متن کاملRandom dyadic tilings of the unit square
A “dyadic rectangle” is a set of the form R = [a2−s, (a+1)2−s]×[b2−t, (b+1)2−t], where s and t are non-negative integers. A dyadic tiling is a tiling of the unit square with dyadic rectangles. In this paper we study n-tilings which consist of 2 nonoverlapping dyadic rectangles, each of area 2−n, whose union is the unit square. We discuss some of the underlying combinatorial structures, provide ...
متن کاملOn Tilings of Quadrants and Rectangles and Rectangular Pattern
The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 319 شماره
صفحات -
تاریخ انتشار 2004